Supporting lock-free composition of concurrent data objects
نویسندگان
چکیده
منابع مشابه
Practical considerations for lock-free concurrent objects
A n important class of concurrent objec t s are those that are lock-free, tha t is, whose operat ions are not conta ined wi th in mutua l ly exclusive critical sect ions . A lock-free object can be accessed by m a n y threads at a t ime , yet clever u p d a t e protocols based on a t o m i c C o m p a r e A n d S w a p operat ions guarantee the object ' s consistency. In th is paper we take a p...
متن کاملLock-free Concurrent Data Structures
Concurrent data structures are the data sharing side of parallel programming. Data structures give the means to the program to store data, but also provide operations to the program to access and manipulate these data. These operations are implemented through algorithms that have to be efficient. In the sequential setting, data structures are crucially important for the performance of the respe...
متن کاملLock-Free Techniques for Concurrent Access to Shared Objects
Concurrent access to shared data in preemptive multi-tasks environment and in multi-processors architecture have been subject of many works. Proposed solutions are commonly based on semaphores which have several drawbacks. For many cases, lock-free techniques constitute an alternate solution and avoid the disadvantages of semaphore based techniques. We present the principle of these lock-free t...
متن کاملCache-Aware Lock-Free Concurrent Hash Tries
This report describes an implementation of a non-blocking concurrent shared-memory hash trie based on single-word compare-andswap instructions. Insert, lookup and remove operations modifying different parts of the hash trie can be run independent of each other and do not contend. Remove operations ensure that the unneeded memory is freed and that the trie is kept compact. A pseudocode for these...
متن کاملConcurrent B-trees with Lock-free Techniques
B-trees and their variants are efficient data structures for finding records in a large collection (e.g., databases). The efficiency of B-trees increases when a number of users can manipulate the tree simultaneously. Many algorithms have been developed over the last three decades to achieve both concurrency and consistency in B-trees. However, current lock-based concurrency-control techniques l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2010
ISSN: 0362-1340,1558-1160
DOI: 10.1145/1837853.1693503